Linear Sets with Five Distinct Differences among Any Four Elements
نویسندگان
چکیده
منابع مشابه
Integer sets with prescribed pairwise differences being distinct
We label the vertices of a given graph G with positive integers so that the pairwise differences over its edges are all distinct. Let D(G) be the smallest value that the largest label can have. For example, for the complete graph Kn, the labels must form a Sidon set. Hence, D(Kn) = (1 + o(1))n2. Rather surprisingly, we demonstrate that there are graphs with only n 3 2 +o(1) edges achieving this...
متن کاملCombining Sets with Elements
We address the problem of combining decision procedures for sets with decision procedures for objects that are not (necessarily) sets. We present Nelson-Oppen-based and tableau-based combination methods, we prove their correctness, analyze their complexity, and we describe heuristics that aim for efficiency.
متن کاملInteger Sets Having the Maximum Number of Distinct Differences
In this paper we study the function D(k, n) which is the maximum of |A − A| = ∣{a − b : a, b ∈ A} ∣∣ over all k-subsets A of {0, . . . , n}. We prove that for any fixed real c ≥ 0 and any function k(n) = (c + o(1)) √ n, the limit d(c) = lim n→∞ D(k(n), n) n exists, as well as present some upper and lower bounds on d(c).
متن کاملSets of elements that pairwise generate a linear group
Let G be any of the groups (P )GL(n, q), (P )SL(n, q). Define a (simple) graph Γ = Γ(G) on the set of elements of G by connecting two vertices by an edge if and only if they generate G. We prove that if the dimension n is at least 12 and not congruent to 2 modulo 4, then the maximum size of a complete subgraph in Γ is equal to the chromatic number of Γ. This work was motivated by a question of ...
متن کاملSums and Products of Distinct Sets and Distinct Elements in C
Let A and B be finite subsets of C such that |B| = C|A|. We show the following variant of the sum product phenomenon: If |AB| < α|A| and α ! log |A|, then |kA+ lB|" |A|k|B|l. This is an application of a result of Evertse, Schlickewei, and Schmidt on linear equations with variables taking values in multiplicative groups of finite rank, in combination with an earlier theorem of Ruzsa about sumset...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1995
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1028